The outbound container slot allocation based on the stowage plan in rail–water intermodal container terminals
نویسندگان
چکیده
منابع مشابه
Constraint-Based Local Search for Container Stowage Slot Planning
Due to the economical importance of stowage planning, there recently has been an increasing interest in developing optimization algorithms for this problem. We have developed 2-phase approach that in most cases can generate near optimal stowage plans within a few hundred seconds for large deep-sea vessels. This paper describes the constrainedbased local search algorithm used in the second phase...
متن کاملThe Role of Simulation and Optimisation in Intermodal Container Terminals
A review of how simulation and optimisation techniques have been applied to help and improve the management of intermodal container terminals is presented. The paper does not provide a detailed list of references and of existing software packages, since it would be very hard for such a list to be complete and exhaustive. This paper aims to identify the major problem classes whose instances can ...
متن کاملStorage space allocation in container terminals
Container terminals are essential intermodal interfaces in the global transportation network. Efficient container handling at terminals is important in reducing transportation costs and keeping shipping schedules. In this paper, we study the storage space allocation problem in the storage yards of terminals. This problem is related to all the resources in terminal operations, including quay cra...
متن کاملReceding–horizon optimal control for container transfer in intermodal terminals
A major feature of intermodal transportation systems is the presence of large container terminals, where loading and unloading of containers are split in different tasks that depend on carrier categories, cargo types and service requirements. The efficiency of a terminal is influenced by the ability to manage the various transfer tasks done by means of quay cranes, transfer cranes, trucks and s...
متن کاملOn the complexity of container stowage planning problems
The optimization of container ship and depot operations embeds the k-shift problem, in which containers must be stowed in stacks such that at most k containers must be removed in order to reach containers below them. We first solve an open problem introduced by Avriel et al. (2000) by showing that changing from uncapacitated to capacitated stacks reduces the complexity of this problem from NP-c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Measurement and Control
سال: 2019
ISSN: 0020-2940
DOI: 10.1177/0020294019842599